Welcome to Binary Trees. The purpose of this workshop is to take binary trees, which are normally abstract entities, out of the textbook and put them in your hands to play and experiment with.
If you are not familiar with the concepts of "binary trees," "pointers," "root node," and "leaf nodes," you should probably take the time now to read about them in your textbook.
A binary tree by itself has no intrinsic value: for it to have meaning, we must choose a way of interpreting what the tree means. In this program, we have two different uses for binary trees: as an alphabetically sorted list, and as a "parse tree." You need not be concerned with both of these areas; if you are interested in just one area, you can ignore the other without problem.
For instructions on how to create a tree in this workshop, see the Help topic "Alphabetical" (or "Parse," if that interests you more).
So, experiment as you like. There are two things to keep in mind: one is that upper and lower case are considered DIFFERENT in this workshop, so "Thrill" <> "thrill". The other is this: you can do anything you want here, including make a mess! A tree created by the Parse menu is the same beast as one created by the Alphabetical menu, but if you start treating a parse tree as if it were an alphabetically sorted tree, you get funny, un-alphabetical results.
But feel free to play around, do what you like, and when you create a jumble, start over fresh with "New".
